Stream Traffic Communication in Packet Switched Networks: Destination Buffering Considerations

In this paper we consider the problem of sending a stream of data (speech, for example) through a packet-switched network which introduces variable source-to-destination delays for different packets of the stream. Ideally, this delay difference should be smoothed so as to preserve the continuity of the stream. We investigate an adaptive destination buffering scheme which may be used to achieve the smoothing of the output stream. The scheme uses delay information, measured for previous streams, in order to compute destination buffering information. Specifically, of the last m packet delays, one discards the largest k and then the range of this partial sample is used for the destination wait time D. We obtain a rule of thumb for choosing m and k , and demonstrate its applicability on some empirical delay distributions from ARPANET measurements. It is, in general, necessary to deal with discontinuities which occur even after smoothing. To this end, we consider two possible playback schemes: Papcr approved by the Editor for Computer Communication of the IEEE Communications Society for publication without oral presentation. Manuscript received March 16, 1981; revised April 6 , 1982. This work was supported by the Advanced Research Projects Agency of the Department of Defense under Contract MDS 903-77-C-0272. W. E. Naylor is with the Information Sciences Research Office, The Aerospace Corporation, Los Angeles, CA 90009. L. Kleinrock is with the Department of Computer Science, University of California, Los Angeles, CA 90024. method E (time expanded in order to preserve information) and method I (late data ignored in order to preserve timing). The two methods are at opposite ends of a continuum of possible playback schemes. We study the implication of methods E and I on the choice of smoothing parameters and establish a foundation for evaluating all schemes in this continuum.